Class HeapNodeFG
java.lang.Object
edu.claflin.finder.algo.clustering.struct.fast_greedy_struct.HeapNodeFG
- All Implemented Interfaces:
Comparable<HeapNodeFG>
- Direct Known Subclasses:
IndexedHeapNode
- Author:
- Cesar Martin
-
Field Summary
Fields -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionintcompareTo(HeapNodeFG that) Compare this HeapNode to that HeapNode.intcompareToQ(HeapNodeFG that) booleanintgetJ()doublegetQ()voidsetInfo(int j, double q) voidsetJ(int j) voidsetQ(double q) toString()
-
Field Details
-
j
private int j -
Q
private double Q -
EPSILON
public static final double EPSILON- See Also:
-
-
Constructor Details
-
HeapNodeFG
public HeapNodeFG(int j, double q)
-
-
Method Details
-
getJ
public int getJ()- Returns:
- the j
-
setJ
public void setJ(int j) -
getQ
public double getQ()- Returns:
- the maxQ
-
setQ
public void setQ(double q) -
setInfo
public void setInfo(int j, double q) -
equals
-
toString
-
compareTo
Compare this HeapNode to that HeapNode. We want before means higher Q, then smaller j- Specified by:
compareToin interfaceComparable<HeapNodeFG>- Parameters:
that- the HeapNode to compare this to- Returns:
- -1 if this goes before, 0 if they are equal, 1 if that goes before
-
compareToQ
-